#include "HRCompany.h"
#include "Employee.h"
#include "CompareEmployeesByID.h"
#include "rational.h"
#include "library1.h"

using namespace DataStructuresWet1;

int main()
{
	//CompareEmployeesByID comparator;
	//Employee emp = Employee(0,0, Rational(1,1));

	//Tree<Employee, int> testTree(comparator);
	//const Tree<Employee, int> ctestTree(comparator);
	//Tree<Employee, int>::PreOrderIterator preIt = testTree.BeginPreOrder();
	//Tree<Employee, int>::PostOrderIterator postIt = testTree.BeginPostOrder();
	//Tree<Employee, int>::InOrderIterator InIt = testTree.BeginInOrder();
	//Tree<Employee, int>::ConstPreOrderIterator cpreIt = ctestTree.BeginPreOrder();
	//Tree<Employee, int>::ConstPostOrderIterator cpostIt = ctestTree.BeginPostOrder();
	//Tree<Employee, int>::ConstInOrderIterator cInIt = ctestTree.BeginInOrder();

	//Tree<Employee, int>::PreOrderIterator preIt = testTree.EndPreOrder();
	//Tree<Employee, int>::PostOrderIterator postIt = testTree.EndPostOrder();
	//Tree<Employee, int>::InOrderIterator InIt = testTree.EndInOrder();
	//Tree<Employee, int>::ConstPreOrderIterator cpreIt = ctestTree.EndPreOrder();
	//Tree<Employee, int>::ConstPostOrderIterator cpostIt = ctestTree.EndPostOrder();
	//Tree<Employee, int>::ConstInOrderIterator cInIt = ctestTree.EndInOrder();
	return 0;
}